Перевод: с английского на русский

с русского на английский

recursive analysis

См. также в других словарях:

  • recursive analysis — rekursinė analizė statusas T sritis automatika atitikmenys: angl. recursive analysis vok. rekursive Analyse, f rus. рекурсивный анализ, m pranc. analyse récursive, f …   Automatikos terminų žodynas

  • Recursive partitioning — is a statistical method for multivariable analysis.cite book |author=Breiman, Leo |title=Classification and Regression Trees |publisher=Chapman Hall/CRC |location=Boca Raton |year=1984 |pages= |isbn=0 412 04841 8 |oclc= |doi=] . Recursive… …   Wikipedia

  • Recursive categorical syntax — Recursive categorical syntax, also sometimes called algebraic syntax, is an algebraic theory of syntax developed by Michael Brame as an alternative to transformational generative grammar. It is a type of dependency grammar, and is related to link …   Wikipedia

  • Recursive set — In computability theory, a set of natural numbers is called recursive, computable or decidable if there is an algorithm which terminates after a finite amount of time and correctly decides whether or not a given number belongs to the set. A more… …   Wikipedia

  • Recursive transition network — A recursive transition network ( RTN ) is a graph theoretical schematic used to represent the rules of a context free grammar. RTNs have application to programming languages, natural language and lexical analysis. Any sentence that is constructed …   Wikipedia

  • analyse récursive — rekursinė analizė statusas T sritis automatika atitikmenys: angl. recursive analysis vok. rekursive Analyse, f rus. рекурсивный анализ, m pranc. analyse récursive, f …   Automatikos terminų žodynas

  • Super-recursive algorithm — In computer science and computability theory, super recursive algorithms are algorithms that are more powerful, that is, compute more, than Turing machines. The term was introduced by Mark Burgin, whose book Super recursive algorithms develops… …   Wikipedia

  • Ordinal analysis — In proof theory, ordinal analysis assigns ordinals (often large countable ordinals) to mathematical theories as a measure of their strength. The field was formed when Gerhard Gentzen in 1934 used cut elimination to prove, in modern terms, that… …   Wikipedia

  • Termination analysis — In computer science, a termination analysis is program analysis which attempts to determine whether the evaluation of a given program will definitely terminate. Because the halting problem is undecidable, termination analysis cannot work… …   Wikipedia

  • Philosophical analysis — (from Greek: Φιλοσοφική ανάλυση) is a general term for techniques typically used by philosophers in the analytic tradition that involve breaking down (i.e. analyzing) philosophical issues. Arguably the most prominent of these techniques is the… …   Wikipedia

  • Constructive analysis — In mathematics, constructive analysis is mathematical analysis done according to the principles of constructive mathematics. This contrasts with classical analysis, which (in this context) simply means analysis done according to the (ordinary)… …   Wikipedia

Поделиться ссылкой на выделенное

Прямая ссылка:
Нажмите правой клавишей мыши и выберите «Копировать ссылку»